Dynamic coloring of graphs having no K5 minor
نویسندگان
چکیده
We prove that every simple connected graph with no K5 minor admits a proper 4-coloring such that the neighborhood of each vertex v having more than one neighbor is not monochromatic, unless the graph is isomorphic to the cycle of length 5. This generalizes the result by S.-J. Kim, S. J. Lee, and W.-J. Park [Dynamic coloring and list dynamic coloring of planar graphs, submitted, 2012] on planar graphs.
منابع مشابه
-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملDefective Choosability of Graphs without Small Minors
For each proper subgraph H of K5, we determine all pairs (k, d) such that every H-minor-free graph is (k, d)-choosable or (k, d)-choosable. The main structural lemma is that the only 3-connected (K5 − e)-minor-free graphs are wheels, the triangular prism, and K3,3; this is used to prove that every (K5 − e)-minor-free graph is 4-choosable and (3, 1)-choosable.
متن کاملThomassen's Choosability Argument Revisited
Thomassen (J. Combin. Theory Ser. B, 62 (1994), pp. 180–181) proved that every planar graph is 5-choosable. This result was generalized by Škrekovski (Discrete Math., 190 (1998), pp. 223–226) and He, Miao, and Shen (Discrete Math., 308 (2008), pp. 4024–4026), who proved that every K5-minor-free graph is 5-choosable. Both proofs rely on the characterization of K5-minorfree graphs due to Wagner (...
متن کاملK6-Minors in Triangulations on the Nonorientable Surface of Genus 3
It is easy to characterize graphs with no Kk-minors for any integer k ≤ 4, as follows. For k = 1, 2, the problem must be trivial, and for k = 3, 4, those graphs are forests and series-parallel graphs (i.e., graphs obtained from K3 by a sequence of replacing a vertex of degree 2 with a pair of parallel edges, or its inverse operation.) Moreover, Wagner formulated a fundamental characterization o...
متن کاملDecomposing infinite graphs
In his classic paper Über eine Eigenschaft der ebenen Komplexe, Wagner [ 19 ] tackles the following problem. Kuratowski’s theorem, in its excluded minor version, states that a finite graph is planar if and only if it has no minor isomorphic to K5 or to K3,3. (A minor of G is any graph obtained from some H ⊂ G by contracting connected subgraphs.) If we exclude only one of these two minors, the g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 206 شماره
صفحات -
تاریخ انتشار 2016